STRONG COLORINGS OVER PARTITIONS

نویسندگان

چکیده

A strong coloring on a cardinal $\kappa$ is function $f:[\kappa]^2\to \kappa$ such that for every $A\subseteq of full size $\kappa$, color $\gamma<\kappa$ attained by $f\upharpoonright[A]^2$. The symbol $\kappa\nrightarrow [\kappa]^2_\kappa$ asserts the existence $\kappa$. We introduce $\kappa\nrightarrow_p[\kappa]^2_\kappa$ which over partition $p:[\kappa]^2\to\theta$. $f$ $p$ if $A\in [\kappa]^\kappa$ there $i<\theta$ so $f\upharpoonright ([A]^2\cap p^{-1}(i))$. prove whenever $\kappa\nrightarrow[\kappa]^2_\kappa$ holds, also holds an arbitrary finite $p$. Similarly, $p$-s can be added to stronger symbols hold in any model ZFC. If $\kappa^\theta=\kappa$, then and symbols, like $\mathrm{Pr}_1(\kappa,\kappa,\kappa,\chi)$ or $\mathrm{Pr}_0(\kappa,\kappa,\kappa,\aleph_0)$, $\theta$ parts.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strong Colorings of Hypergraphs

A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph coloring problems. We present nearly tight upper and lower bound on approximating general hypergraphs, both offline and online. We then consider various parameters that make coloring easier, and give a unified treatment. In particular...

متن کامل

Polychromatic colorings of arbitrary rectangular partitions

A general (rectangular) partition is a partition of a rectangle into an arbitrary number of non-overlapping subrectangles. This paper examines vertex colorings using four colors of general partitions where every subrectangle is required to have all four colors appear on its boundary. It is shown that there exist general partitions that do not admit such a coloring. This answers a question of Di...

متن کامل

Monochromatic Cycle Partitions in Local Edge Colorings

An edge colouring of a graph is said to be an r-local colouring if the edges incident to any vertex are coloured with at most r colours. Generalising a result of Bessy–Thomassé and others, we prove that the vertex set of any 2-locally coloured complete graph may be partitioned into two disjoint monochromatic cycles of different colours. Moreover, for any natural number r, we show that the verte...

متن کامل

Polychromatic Colorings of n-Dimensional Guillotine-Partitions

A strong hyperbox-respecting coloring of an n-dimensional hyperbox partition is a coloring of the corners of its hyperboxes with 2n colors such that any hyperbox has all the colors appearing on its corners. A guillotine-partition is obtained by starting with a single axis-parallel hyperbox and recursively cutting a hyperbox of the partition into two hyperboxes by a hyperplane orthogonal to one ...

متن کامل

Dominator Colorings and Safe Clique Partitions

Given a graph G, the dominator coloring problem seeks a proper coloring of G with the additional property that every vertex in the graph dominates an entire color class. The safe clique partition problem seeks a partition of the vertices of a graph into cliques with the additional property that for each vertex v, there is a clique that has no element in the open neighborhood of v. We typically ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Bulletin of Symbolic Logic

سال: 2021

ISSN: ['1943-5894', '1079-8986']

DOI: https://doi.org/10.1017/bsl.2021.5